A two-variable linear program solves the standard linear-quadratic formulation of the fractionation problem in cancer radiotherapy

نویسندگان

  • Fatemeh Saberian
  • Archis Ghate
  • Minsun Kim
چکیده

The standard formulation of the fractionation problem with multiple organs-at-risk based on the linear-quadratic dose-response model requires the solution of a nonconvex quadratically constrained quadratic program. Existing literature therefore uses heuristic methods without any analyses about solution quality. There is no known method that is guaranteed to find an optimal solution. We prove that this formulation of the fractionation problem can in fact be solved to optimality by instead solving a two-variable linear program with a few constraints.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Finite Element Formulation for Buckling and Free Vibration Analysis of Timoshenko Beams on Variable Elastic Foundation

In this study, the buckling and free vibration of Timoshenko beams resting on variable elastic foundation analyzed by means of a new finite element formulation. The Winkler model has been applied for elastic foundation. A two-node element with four degrees of freedom is suggested for finite element formulation. Displacement and rotational fields are approximated by cubic and quadratic polynomia...

متن کامل

DOES HYPERFRACTIONATED RADIOTHERAPY CHANGE THE OUTCOME OF HEAD AND NECK CANCER? A TRIAL COMPARING CONVENTIONAL WITH HYPERFRACTIONATED RADIOTHERAPY

The optimal fractionation schedule for radiotherapy of head and neck cancer has been controversial. The objective of this randomized trial was to test the efficacy of hyperfractionation vs. standard fractionation. Patients with squamous cell carcinoma of head and neck organs were randomly assigned to receive radiotherapy delivered with A) standard fractionation at 2 Gy/fraction/day, 5 days...

متن کامل

Solving A Fractional Program with Second Order Cone Constraint

We consider a fractional program with both linear and quadratic equation in numerator and denominator  having second order cone (SOC) constraints. With a suitable change of variable, we transform the problem into a  second order cone programming (SOCP)  problem.  For the quadratic fractional case, using a relaxation, the problem is reduced to a semi-definite optimization (SDO) program. The p...

متن کامل

Support vector regression with random output variable and probabilistic constraints

Support Vector Regression (SVR) solves regression problems based on the concept of Support Vector Machine (SVM). In this paper, a new model of SVR with probabilistic constraints is proposed that any of output data and bias are considered the random variables with uniform probability functions. Using the new proposed method, the optimal hyperplane regression can be obtained by solving a quadrati...

متن کامل

About One Sweep Algorithm for Solving Linear-Quadratic Optimization Problem with Unseparated Two-Point Boundary Conditions

In the paper a linear-quadratic optimization problem (LCTOR) with unseparated two-point boundary conditions is considered. To solve this problem is proposed a new sweep algorithm which increases doubles the dimension of the original system. In contrast to the well-known methods, here it refuses to solve linear matrix and nonlinear Riccati equations, since the solution of such multi-point optimi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Oper. Res. Lett.

دوره 43  شماره 

صفحات  -

تاریخ انتشار 2015